منابع مشابه
A lower bound for computing Oja depth
Let S = {s1, . . . , sn} be a set of points in the plane. The Oja depth of a query point θ with respect to S is the sum of the areas of all triangles (θ, si, sj). This depth may be computed in O(n log n) time in the RAM model of computation. We show that a matching lower bound holds in the algebraic decision tree model. This bound also applies to the computation of the Oja gradient, the Oja sig...
متن کاملDepth lower bound for matching
Definition 2.1. Let f : X × Y → V . A subset R of X × Y is a rectangle1 if it is of the form A × B for some A ⊆ X and B ⊆ Y . The rectangle R is said to be monochromatic (wrt. f) if f is constant on R. A monochromatic rectangle R is a 0-rectangle if f(R) = {0}; it is a 1-rectangle if f(R) = {1}. Observation 2.2. A subset S of X × Y is a rectangle iff for all x, x′ ∈ X and y, y′ ∈ Y (x, x′) ∈ S ...
متن کاملMonotone depth lower bound for st connectivity
In Lecture 2, we saw how communication complexity lower bounds yield lower bounds for circuit depth. In particular, we showed that for any function f , D(KWf ) = depth(f) and D(KW f ) = depth (f), where KWf denotes the Karchmer-Wigderson game on f . Using this, we showed that monotone circuits for matching require Ω(n) depth. In this lecture we will show that circuits solving directed s-t conne...
متن کاملA Lower Bound for Computing Lagrange's Real Root Bound
In this paper, we study a bound on the real roots of a polynomial by Lagrange. From known results in the literature, it follows that Lagrange’s bound is also a bound on the absolute positiveness of a polynomial. A simple O(n logn) algorithm described in Mehlhorn-Ray (2010) can be used to compute the bound. Our main result is that this is optimal in the real RAM model. Our paper explores the tra...
متن کاملA quadratic lower bound for colourful simplicial depth
We show that any point in the convex hull of each of (d+1) sets of (d+ 1) points in R is contained in at least ⌊
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2005
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2005.05.014